Efficient Space Leaping for Raycasting Architectures
نویسندگان
چکیده
One of the most severe problems for ray casting architectures is the waste of computation cycles and I/O bandwidth, due to redundant sampling of empty space. While several techniques exist for software implementations to skip these empty regions, few are suitable for hardware implementation. The few which have been presented either require a tremendous amount of logic or are not feasible for high frequency designs (i.e. running at 100 MHz) where latency is the one of the biggest issues. In this paper, we present an efficient space leaping mechanism which requires only a small amount of SRAM (4 Kbit for a 256 volume) and can be easily integrated into ray casting architectures. For each sub-cube of the volume, a bit is stored in an occupancy map, which can be generated in real-time, using the VIZARD II architecture. Hence, space leaping can be classification dependent achieving yet another significant speed-up over skipping only the empty space (voxel = 0). Using a set of real-world datasets, we show that frame-rates well above 15 frames per second can be accomplished for the VIZARD II architecture.
منابع مشابه
Accelerating Volume Raycasting using Occlusion Frustums
GPU-based volume raycasting allows to produce high quality renderings on current graphics hardware. The use of such raycasters is on the rise due to their inherent flexibility as well as the advances in hardware performance and functionality. Although recent raycasting systems achieve interactive frame rates on high-end graphics hardware, further improved performance would enable more complex r...
متن کاملA refined data addressing and processing scheme to accelerate volume raycasting
Most volume rendering systems based on CPU volume raycasting still suffer from inefficient CPU utilization and high memory usage. To target these issues we present a new technique for efficient data addressing. Furthermore, we introduce a new processing scheme for volume raycasting which exploits thread-level parallelism—a technology now supported by commodity computer architectures. r 2004 Els...
متن کامل$S$-Leaping: An adaptive, accelerated stochastic simulation algorithm, bridging $\tau$-leaping and $R$-leaping
We propose the S-leaping algorithm for the acceleration of Gillespie’s stochastic simulation algorithm that combines the advantages of the two main accelerated methods; the τ -leaping and R-leaping algorithms. These algorithms are known to be efficient under different conditions; the τ -leaping is efficient for non-stiff systems or systems with partial equilibrium, while the R-leaping performs ...
متن کاملAccurate implementation of leaping in space: the spatial partitioned-leaping algorithm.
There is a great need for accurate and efficient computational approaches that can account for both the discrete and stochastic nature of chemical interactions as well as spatial inhomogeneities and diffusion. This is particularly true in biology and nanoscale materials science, where the common assumptions of deterministic dynamics and well-mixed reaction volumes often break down. In this arti...
متن کاملSolving the Hazard Problem for Algorithmically Optimized Real-Time Volume Rendering
One of the most difficult problems in volume rendering hardware architectures is to provide an efficient hardware integration of algorithmic optimization techniques like, space leaping and early ray termination. An architecture, which solves this problem, is presented in this paper. It is based on a multithreaded approach that overcomes branch hazards caused by these algorithmic optimization te...
متن کامل